On the numerical study of percolation and epidemic critical properties in networks
نویسندگان
چکیده
The static properties of the fundamental model for epidemics of diseases allowing immunity (susceptible-infected-removed model) are known to be derivable by an exact mapping to bond percolation. Yet when performing numerical simulations of these dynamics in a network a number of subtleties must be taken into account in order to correctly estimate the transition point and the associated critical properties. We expose these subtleties and identify the different quantities which play the role of criticality detector in the two dynamics. PACS. 89.75.Hc Networks and genealogical trees – 05.70.Ln Nonequilibrium and irreversible thermodynamics – 87.23.Ge Dynamics of social systems – 89.75.Da Systems obeying scaling laws
منابع مشابه
A Review of Epidemic Forecasting Using Artificial Neural Networks
Background and aims: Since accurate forecasts help inform decisions for preventive health-careintervention and epidemic control, this goal can only be achieved by making use of appropriatetechniques and methodologies. As much as forecast precision is important, methods and modelselection procedures are critical to forecast precision. This study aimed at providing an overview o...
متن کاملShift of percolation thresholds for epidemic spread between static and dynamic small-world networks
The study compares the epidemic spread on static and dynamic small-world networks. They are constructed as a 2-dimensional Newman and Watts model (500 × 500 square lattice with additional shortcuts), where the dynamics involves rewiring shortcuts in every time step of the epidemic spread. We assume susceptible-infectious-removed (SIR) model of the disease. We study the behaviour of the epidemic...
متن کاملTemporal percolation in activity-driven networks.
We study the temporal percolation properties of temporal networks by taking as a representative example the recently proposed activity-driven-network model [N. Perra et al., Sci. Rep. 2, 469 (2012)]. Building upon an analytical framework based on a mapping to hidden variables networks, we provide expressions for the percolation time Tp marking the onset of a giant connected component in the int...
متن کاملPercolation and epidemic thresholds in clustered networks.
We develop a theoretical approach to percolation in random clustered networks. We find that, although clustering in scale-free networks can strongly affect some percolation properties, such as the size and the resilience of the giant connected component, it cannot restore a finite percolation threshold. In turn, this implies the absence of an epidemic threshold in this class of networks, thus e...
متن کاملPercolation Approach to Study Connectivity in Living Neural Networks
We study neural connectivity in cultures of rat hippocampal neurons. We measure the neurons’ response to an electric stimulation for gradual lower connectivity, and characterize the size of the giant cluster in the network. The connectivity undergoes a percolation transition described by the critical exponent β ≃ 0.65. We use a theoretic approach based on bond–percolation on a graph to describe...
متن کامل